Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
961	On the Security of Hash Functions Employing Blockcipher Postprocessing Donghoon Chang1 , Mridul Nandi2 , and Moti Yung3 1 3 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-12-10 07:46:56 Computational complexity theory Preimage attack Basketball at the 2009 Summer Universiade Cryptographic hash functions
962	How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-01 02:12:54 Computational complexity theory Interactive proof system NEXPTIME Probabilistically checkable proof IP Cryptographic protocols Soundness NP Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes
963	Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-09-15 12:03:01 Computational complexity theory IP Proof of knowledge Zero-knowledge proof NP Probabilistically checkable proof Soundness Formal verification Snark Theoretical computer science Applied mathematics Cryptographic protocols
964	Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-02-23 00:05:29 Applied mathematics Computational complexity theory Algorithms Streaming algorithm Ε-net Approximation algorithms Computational geometry Mathematics
965	Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets Yevgeniy Dodis∗ Daniel Wichs† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-04-05 17:10:39 Randomness Information theory Computational complexity theory Randomness extractor Extractor Leftover hash lemma Min-entropy Entropy Secret sharing Cryptography Applied mathematics Theoretical computer science
966	A Survey of Automated Timetabling A. Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:16 Mathematical optimization Operations research Search algorithms Complexity classes Combinatorial optimization Genetic algorithm Optimization problem Constraint satisfaction NP-complete Theoretical computer science Applied mathematics Computational complexity theory
967	Multiparty Key Agreement using Bilinear Map Nam-Su Jho, Myung-Hwan Kim, Do Won Hong and Byung-Gil Lee ABSTRACT ⎯ A key agreement protocol is a cryptographical primitive which allows participants to share a common secre Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-17 20:17:06 Computer science Advantage Polynomial Time complexity Low Algorithm Applied mathematics Computational complexity theory Mathematics
968	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 27 May 2010 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2011-04-04 11:42:17 Analysis of algorithms Algorithm Mathematical logic Time complexity Regular expression P Randomized algorithm Median graph Theoretical computer science Computational complexity theory Applied mathematics
969	— A merged version of this work and the work of [DJKL12] appears in the proceedings of the Theory of Cryptography Conference - TCC 2013 — Why “Fiat-Shamir for Proofs” Lacks a Proof Nir Bitansky∗ Tel Aviv Univer Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 16:42:35 Search algorithms Computational complexity theory Random oracle Interactive proof system Hash function Zero-knowledge proof Universal hashing Collision resistance Hash list Cryptography Cryptographic hash functions Hashing
970	Unprovable Security of Two-Message Zero Knowledge Kai-Min Chung∗ Edward Lui∗ Mohammad Mahmoody∗ Rafael Pass∗ December 19, 2012 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 11:29:49 Complexity classes Cryptographic protocols Probabilistic complexity theory Interactive proof system Probabilistically checkable proof IP Soundness Zero-knowledge proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE